On Herbrand Skeletons

Herbrand's theorem plays an important role both in proof theory and in computer science. Given a Herbrand skeleton, which is basically a number specifying the count of disjunctions of the matrix, we would like to get a computable bound on the size of terms which make the disjunction into a quasitautology. This is an important problem in logic, speciically in the complexity of proofs. In computer science, speciically in automated theorem proving, one hopes for an algorithm which avoids the guesses of existential substitution axioms involved in proving a theorem. Herbrand's theorem forms the very basis of automated theorem proving where for a given number n we would like to have an algorithm which nds the terms in the n disjunctions of matrices solely from the shape of the matrix. The main result of this paper is that both problems have negative solutions.